Enumeration of chains and saturated chains in Dyck lattices
نویسندگان
چکیده
منابع مشابه
Enumeration of saturated chains in Dyck lattices
We determine a general formula to compute the number of saturated chains in Dyck lattices, and we apply it to find the number of saturated chains of length 2 and 3. We also compute what we call the Hasse index (of order 2 and 3) of Dyck lattices, which is the ratio between the total number of saturated chains (of length 2 and 3) and the cardinality of the underlying poset.
متن کاملSaturated chains in composition posets
We study some poset structures on the set of all compositions. In the first case, the covering relation consists of inserting a part of size one to the left or to the right, or increasing the size of some part by one. The resulting poset N was studied by the author in [5] in relation to non-commutative term orders, and then in [6], where some results about generating functions for standard path...
متن کاملChains of saturated models in AECs
We study when a union of saturated models is saturated in the framework of tame abstract elementary classes (AECs) with amalgamation. We prove: Theorem 0.1. If K is a tame AEC with amalgamation satisfying a natural definition of superstability (which follows from categoricity in a high-enough cardinal), then for all high-enough λ: (1) The union of an increasing chain of λ-saturated models is λ-...
متن کاملMaximal Chains and Antichains in Boolean Lattices
The following equivalent results in the Boolean lattice 2 are proven. (a) Every fibre of 2 contains a maximal chain. (b) Every cutset of 2 contains a maximal antichain. (c) Every red-blue colouring of the vertices of 2 produces either a red maximal chain or a blue maximal antichain. (d) Given any n antichains in 2 there is a disjoint maximal antichain. Statement (a) is then improved to: (a') Ev...
متن کاملThe Length of Chains in Algebraic Lattices
We study how the existence in an algebraic lattice L of a chain of a given type is reflected in the join-semilattice K(L) of its compact elements. We show that for every chain α of size κ, there is a set B of at most 2 join-semilattices, each one having a least element such that an algebraic lattice L contains no chain of order type I(α) if and only if the join-semilattice K(L) of its compact e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Applied Mathematics
سال: 2015
ISSN: 0196-8858
DOI: 10.1016/j.aam.2014.09.003